Rate-distortion function via minimum mean square error estimation

نویسنده

  • Neri Merhav
چکیده

We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the distortion ∆ = d(X, Y ) based on the source symbol X , with respect to a certain joint distribution of these two random variables. At first glance, these relations may seem somewhat similar to the I–MMSE relations due to Guo, Shamai and Verdú, but they are, in fact, quite different. The new relations among rate, distortion, and MMSE are discussed from several aspects, and more importantly, it is demonstrated that they can sometimes be rather useful for obtaining non–trivial upper and lower bounds on the rate–distortion function, as well as for determining the exact asymptotic behavior for very low and for very large distortion. Analogous MMSE relations hold for channel capacity as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Rate-Distortion Function via Minimum Mean Square Error Estimation

We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the distortion ∆ = d(X, Y ) based on the source symbol X , with respect to a certain joint distribution of these two random variables. At first glance, these rel...

متن کامل

Upper-Bounding Rate Distortion Functions based on the Minimum Mean-Square Error

We derive a new upper bound on the rate distortion function for arbitrary memoryless sources, which is based on the relation between mutual information and minimum mean-square error discovered by Guo et al. This upper bound is in general tighter than the well known upper bound given by the rate distortion function of a Gaussian source with an equal variance found by Shannon and becomes tight fo...

متن کامل

Rate distortion lower bound for a of nonlinear estimation problems

A rate distortion lower bound of minimum mean square error is presented for a special class of discrete time nonlinear filtering problems which have measurements that can be expressed as a memoryless nonlinear function of a Gaussian distributed space process with additive Gaussian noise. The lower bound is exactly and practically computable for a large class of nonlinearities and is proved to b...

متن کامل

Adaptive Non-linear Pre-distortion

∙ Suitable for digital modulation (QAM, OFDM). ∙ 3rd and 5th order distortion correction. ∙ Iterative Minimum Mean Square Error algorithm. ∙ Complex 3rd and 5th order coefficient estimation and real-time application. ∙ Selectable iterative algorithm convergence speed. ∙ Automatic timing recovery on feedback signal. ∙ Automatic phase recovery on feedback signal. ∙ Automatic forward power control...

متن کامل

Image Compression Using Dpcm with Lms Algorithm

The image compression in telecommunication is very demanding application to control the distortion in image in channel after transmitting the image. The Differential pulse code modulation (DPCM) may be used to remove the unused bit in the image for image compression. In this thesis we compare the compressed image for 1, 2, 3, bits (2, 4 and 8 quantization levels, respectively), estimation error...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2011